A Gleason Formula for Ozeki Polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Gleason Formula for Ozeki Polynomials

By using the structure theory of Jacobi forms we derive a simple expression for Ozeki polynomials of Type II self-dual binary codes.

متن کامل

Ozeki Polynomials and Jacobi Forms

A Jacobi polynomial was introduced by Ozeki. It corresponds to the codes over F2. Later, Bannai and Ozeki showed how to construct Jacobi forms with various index using a Jacobi polynomial corresponding to the binary codes. It generalizes Broué-Enguehard map. In this paper, we study Jacobi polynomial which corresponds to the codes over F2f . We show how to construct Jacobi forms with various ind...

متن کامل

A combinatorial formula for Macdonald polynomials

Abstract. In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GLn. At q = 0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove...

متن کامل

A Determinantal Formula for Supersymmetric Schur Polynomials

We derive a new formula for the supersymmetric Schur polynomial sλ(x/y). The origin of this formula goes back to representation theory of the Lie superalgebra gl(m/n). In particular, we show how a character formula due to Kac and Wakimoto can be applied to covariant representations, leading to a new expression for sλ(x/y). This new expression gives rise to a determinantal formula for sλ(x/y). I...

متن کامل

A Combinatorial Formula for Macdonald Polynomials

The Macdonald polynomials H̃μ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representation-theoretic means, but these results do not provide any purely combinatorial interpretation fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2002

ISSN: 0097-3165

DOI: 10.1006/jcta.2001.3226